Certified Grammar Transformation to Chomsky Normal Form in F*
نویسندگان
چکیده
منابع مشابه
Greibach Normal Form Transformation, Revisited
We develop a new method for placing a given context-free grammar into Greibach normal form with only polynomial increase of its size. Starting with an arbitrary "-free context-free grammar G, we transform G into an equivalent context-free grammar H in extended Greibach normal form; i.e., in addition to rules, fulllling the Greibach normal form properties, the grammar can have chain rules. The s...
متن کاملGenerating all Circular Shifts by Context-Free Grammars in Chomsky Normal Form
Let {a1, a2, . . . , an} be an alphabet of n symbols and let Cn be the language of circular shifts of the word a1a2 · · · an; so Cn = {a1a2 · · · an−1an, a2a3 · · · ana1, . . . , ana1 · · · an−2an−1}. We discuss a few families of context-free grammars Gn (n ≥ 1) in Chomsky normal form such that Gn generates Cn. The grammars in these families are investigated with respect to their descriptional ...
متن کاملGenerating all permutations by context-free grammars in Chomsky normal form
Let Ln be the finite language of all n! strings that are permutations of n different symbols (n ≥ 1). We consider context-free grammars Gn in Chomsky normal form that generate Ln. In particular we study a few families {Gn}n≥1, satisfying L(Gn) = Ln for n ≥ 1, with respect to their descriptional complexity, i.e. we determine the number of nonterminal symbols and the number of production rules of...
متن کاملEecient Normal-form Parsing for Combinatory Categorial Grammar
Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inee-cient and obscures whatever true semantic ambiguities are in the input. This paper addresses the problem for a fairly general form of Combinatory Categorial Grammar, by means of an eecient, correct, and easy to implement normal-form pars...
متن کاملEfficient Normal-Form Parsing for Combinatory Categorial Grammar
Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inefficient and obscures whatever true semantic ambiguities are in the input. This paper addresses the problem for a fairly general form of Combinatory Categorial Grammar, by means of an efficient, correct, and easy to implement normal-form p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Institute for System Programming of the RAS
سال: 2016
ISSN: 2079-8156,2220-6426
DOI: 10.15514/ispras-2016-28(2)-8